BDD Based Construction of Resilient Functions
نویسندگان
چکیده
The construction of modern cryptographic systems relies on the so-called resilient Boolean functions, a special class of Boolean functions that possesses a balance between a high level of nonlinearity and correlation immunity. In this paper, we discuss the problem of the compact representation and efficient construction of resilient functions. Binary Decision Diagrams (BDDs) were extensively used as a method of compact representation of various classes of Boolean functions. Furthermore, BDDs offer an opportunity for the efficient implementation of different construction methods for resilient functions. In this paper, we make use of BDDs with attributed edges to provide an implementation of two construction methods proposed by Maitra and Sakar. In addition, we demonstrate that the size of BDDs of resilient functions obtained in this way grows linearly with the number of variables.
منابع مشابه
Proof of a BDD Manager in the Context ofSatis ability
We present a compositional proof of correctness for a binary decision diagram (BDD) manager used in the context of a propositional satissability checker implemented using Single-Threaded Objects (stobjs) in ACL2. The use of stobjs aaords the deenition of an eecient BDD manager which ensures unique construction, allows constant-time comparison, and caches previously computed results. The use of ...
متن کاملOn construction of resilient functions
An (n, m, t) resilient function is a function f: f0,1g n ?!f0,1g m such that every possible output m-tuple is equally likely to occur when the values of t arbitrary inputs are xed by an opponent and the remaining n ? t input bits are chosen independently at random. The existence of resilient functions has been largely studied in terms of lower and upper bounds. The construction of such function...
متن کاملHaar Spectrum based Construction of Resilient and Plateaued Boolean Functions
Stream cipher systems are considered desirable and secure if composed of Boolean functions (B.Fs) that are characterized by high resiliency. Resiliency is one of the main cryptographic security criteria for a given Boolean function. One of the classes of functions satisfying high resiliency with desirable cryptographic properties include the Plateaued functions whose design construction is of s...
متن کاملGeneralized Maiorana-McFarland Constructions for Almost Optimal Resilient Functions
In a recent paper [1], Zhang and Xiao describe a technique on constructing almost optimal resilient functions on even number of variables. In this paper, we will present an extensive study of the constructions of almost optimal resilient functions by using the generalized MaioranaMcFarland (GMM) construction technique. It is shown that for any given m, it is possible to construct infinitely man...
متن کاملA New Construction of Resilient Boolean Functions with High Nonlinearity
In this paper we develop a technique that allows us to obtain new effective construction of 1-resilient Boolean functions with very good nonlinearity and autocorrelation. Our strategy to construct a 1-resilient function is based on modifying a bent function, by toggling some of its output bits. Two natural questions that arise in this context are “at least how many bits and which bits in the ou...
متن کامل